STOCHASTIC KNAPSACK PROBLEM: APPLICATION TO TRANSPORTATION PROBLEMS
نویسندگان
چکیده
منابع مشابه
Stochastic Knapsack Problems
In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well the stochastic knapsack problem with probabilistic constraint. Special regard is given the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous problems serve...
متن کاملThe Stochastic Knapsack Problem with Random Weights: A Heuristic Approach to Robust Transportation Planning
When transportation plans are developed, problem parameters are often not known with certainty. In addition, the parameters may vary throughout the time period during which the plan is implemented. Thus, improvements can often be made in the quality of such plans by accounting for this variability. However, incorporating stochasticity into problems that are already large-scale and difficult to ...
متن کاملOn a Stochastic Knapsack Problem
The deterministic knapsack problem is a well known and well studied NP-hard combinatorial optimization problem. It consists in filling a knapsack with items out of a given set such that the weight capacity of the knapsack is respected and the total reward maximized. For a review of references on the stochastic knapsack problem, stochastic gradient algorithms and branch-and-bound methods see [4]...
متن کاملDistributionally Robust Stochastic Knapsack Problem
This paper considers a distributionally robust version of a quadratic knapsack problem. In this model, a subsets of items is selected to maximizes the total profit while requiring that a set of knapsack constraints be satisfied with high probability. In contrast to the stochastic programming version of this problem, we assume that only part of information on random data is known, i.e., the firs...
متن کاملThe Adaptive Knapsack Problem with Stochastic Rewards
Given a set of items with associated deterministic weights and random rewards, the Adaptive Stochastic Knapsack Problem (Adaptive SKP) maximizes the probability of reaching a predetermined target reward level when items are inserted sequentially into a capacitated knapsack before the reward of each item is realized. This model arises in resource allocation problems which permit or require seque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2017
ISSN: 1678-5142,0101-7438
DOI: 10.1590/0101-7438.2017.037.03.0597